Using PO Methods for Verfying Behavioural Equivalences
نویسندگان
چکیده
The modelling of concurrent systems by synchronized distributed automata generates naturally an independence notion between the events of the global system. The theory of (Mazurkiewicz) traces suggests that such an independence relation induces a nice equivalence relation over the sequences of events of the system. Two sequences will be equivalent just in case they constitute two different interleavings of the same stretch of partially ordered behavior. We want to use reductions of the interleaved global system by this independence relation for verification means. The allowed reduction depends on the property to conserve, the prime condition being to retain at least one representative for each trace. Others recent published works on these methods (often called Partial-Order methods) have proposed the checking of particular linear temporal properties on these reduced models. We study it here in the context of equivalence checking, where a concurrent process description is confronted to a specification by comparing their labeled transition systems together (relative to bisimulation for instance). We define a reduced global automaton with predicates on the states where transitions were suppressed, and conditions for retaining enough information for representing the global system for verification. The limits of the approach are shown as well as suggestions for practical applications and some experimental results on classical examples.
منابع مشابه
Behavioural equivalences for coalgebras with unobservable moves
We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on special order enriched categories, i.e. categories whose homsets are endowed with suitable complete orders. Using this structure we provide an abstract notion of saturation, which allows us to define various (weak) be...
متن کاملBehavioural Equivalences over Migrating Processes with Timers
The temporal evolution of mobile processes is governed by independently operating local clocks and their migration timeouts. We define a formalism modelling such distributed systems allowing (maximal) parallel execution at each location. Taking into account explicit timing constraints based on migration and interprocess communication, we introduce and study a number of timed behavioural equival...
متن کاملBack-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the whole class of Petri nets as well as for their subclass of sequential nets. In addition, the preservation of ...
متن کاملPo - Spaces
Locally partial-ordered spaces (local po-spaces) have been used to model concurrent systems. We provide equivalences for these spaces by constructing a model category containing the category of local po-spaces. We show the category of simplicial presheaves on local po-spaces can be given Jardine's model structure, in which we identify the weak equivalences between local po-spaces. In the proces...
متن کاملA Model Category for Local Po-spaces
Locally partial-ordered spaces (local po-spaces) have been used to model concurrent systems. We provide equivalences for these spaces by constructing a model category containing the category of local po-spaces. We show the category of simplicial presheaves on local po-spaces can be given Jardine’s model structure, in which we identify the weak equivalences between local po-spaces. In the proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995